Routing permutations in Partitioned Optical Passive Stars Networks

Routing Permutations in Partitioned Optical Passive Star Networks

It is shown that a Partitioned Optical Passive Stars (POPS) network with g groups and d processors per group can route any permutation among the n = dg processors in one slot when d = 1 and 2⌈d/g⌉ slots when d > 1. The number of slots used is optimal in the worst case, and is at most the double of the optimum for all permutations π such that π(i) = i, for all i.

Matrix Multiplication and Data Routing Using a Partitioned Optical Passive Stars Network

Realizing Common Communication Patterns in Partitioned Optical Passive Stars (POPS) Networks

We consider the problem of realizing several common communication structures in the all-optical Partitioned Optical Passive Stars (POPS) topology. We show that, often, the obvious or “natural” method of implementing a communication pattern in the POPS does not efficiently utilize its communication capabilities. We present techniques which distribute the communication load uniformly in the POPS ...

Multiprocessor Architectures Using Multi-Hop Multi-OPS Lightwave Networks and Distributed Control

Advances in optical technology have increased the interest for multiprocessor architectures based on lightwave networks because of the vast bandwidth available. In this paper we propose a passive star multi-hop lightwave network called stack-Kautz, based on the Kautz graph. We show that this architecture is very cost-effective with respect to its resources requirements. We also propose control ...

Parallel Computation of Data Summation for Multiple Problem Spaces on Partitioned Optical Passive Stars Network

In Partitioned Optical Passive Stars POPS network, nodes and couplers become free after slot to slot in some computation. It is necessary to efficiently utilize free couplers and nodes to be cost effective. Improving parallelism, we present the fast data summation algorithm for multiple problem spaces on POPS(g, g) with smaller number of nodes for the case of d = √ n = g. For the case of d > √ ...